A New Two-Dimensional Interleaving Technique Using Successive Packing
نویسندگان
چکیده
Correction of two-dimensional (2-D) and three-dimensional (3-D) error bursts finds wide applications in secure data handling such as 2-D and 3-D magnetic and optical data storage, charged-coupled devices (CCDs), 2-D barcodes, and information hiding in digital images and video sequences, to name a few. In this paper, we present a new 2-D interleaving technique, called successive packing, to combat 2-D spot burst errors, which is potential to extend to multidimensional (M-D) interleaving. Square arrays of 2 2 are considered. It is shown that the proposed successive packing technique can spread any error burst of 2 2 (with 1 1), 2 2 +1 (with 0 1), and 2 +1 2 (with 0 1) effectively so that the error burst can be corrected with some simple random-error-correction code (provided the error-correction code is available). It is further shown that the technique is optimal for combating all the above-mentioned error bursts in the sense that the interleaving degree reaches its lower bound. This implies that the algorithm needs to be implemented only once for a given 2-D array and is thereafter optimal for the set of error bursts having different sizes. A performance comparison between the proposed method and some existing techniques is given and the future research is discussed.
منابع مشابه
Interleaving for combating bursts of errors - Circuits and Systems Magazine, IEEE
FIRST QUARTER 2004 1540-7977/04/$20.00©2004 IEEE IEEE CIRCUITS AND SYSTEMS MAGAZINE To ensure data fidelity, a number of random error correction codes (ECCs) have been developed. ECC is, however, not efficient in combating bursts of errors, i.e., a group of consecutive (in one-dimensional (1-D) case) or connected (in twoand threedimensional (2D and 3-D) case) erroneous code symbols owing to the...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملOptimal Interleaving on Tori
This paper studies t-interleaving on two-dimensional tori, which is defined by the property that every connected subgraph of order t in the torus is labelled by t distinct integers. This is the first time that the t-interleaving problem is solved for graphs of modular structures. t-interleaving on tori has applications in distributed data storage and burst error correction, and is closely relat...
متن کاملAbstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001